A nonlinear map for midpoint locally uniformly rotund renorming
نویسندگان
چکیده
منابع مشابه
On non-midpoint locally uniformly rotund normability in Banach spaces
We will show that if X is a tree-complete subspace of ∞ , which contains c 0 , then it does not admit any weakly midpoint locally uniformly convex renorming. It follows that such a space has no equivalent Kadec renorming. 1. Introduction. It is known that ∞ has an equivalent strictly convex renorming [2]; however, by a result due to Lindenstrauss, it cannot be equivalently renormed in locally u...
متن کاملA Constructive Analysis of Convex-Valued Demand Correspondence for Weakly Uniformly Rotund and Monotonic Preference
Bridges 1992 has constructively shown the existence of continuous demand function for consumers with continuous, uniformly rotund preference relations. We extend this result to the case of multivalued demand correspondence. We consider a weakly uniformly rotund and monotonic preference relation and will show the existence of convex-valued demand correspondence with closed graph for consumers wi...
متن کاملSchauder bases under uniform renormings
Let X be a separable superreflexive Banach space with a Schauder basis. We prove the existence of an equivalent uniformly smooth (resp. uniformly rotund) renorming under which the given basis is monotone. Mathematics Subject Classification (2000). 46B03.
متن کاملUniformly smooth renorming of Banach spaces with modulus of convexity of power type 2
An upper bound q(c) for the best, under equivalent renorming, possible power type of the modulus of smoothness of a Banach space with modulus of convexity satisfying δX(ε) cε2, is found. The estimate is asymptotically sharp and is expressed in terms of linear fractional function q(c). © 2006 Elsevier Inc. All rights reserved.
متن کاملGeneralized Uniformly Optimal Methods for Nonlinear Programming
In this paper, we present a generic framework to extend existing uniformly optimal convex programming algorithms to solve more general nonlinear, possibly nonconvex, optimization problems. The basic idea is to incorporate a local search step (gradient descent or Quasi-Newton iteration) into these uniformly optimal convex programming methods, and then enforce a monotone decreasing property of th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 2005
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700034857